
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 2390. -- 序列划分 -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>2390: 序列划分</h2><span class=green>Time Limit: </span>10 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>128 MB<br><span class=green>Submit: </span>3&nbsp;&nbsp;<span class=green>Solved: </span>2<br>[<a href='submitpage.php?id=2390'>Submit</a>][<a href='problemstatus.php?id=2390'>Status</a>][<a href='bbs.php?id=2390'>Discuss</a>]</center><h2>Description</h2><div class=content><div>最近小风沉醉于研究数。</div>
<div>由于他对0情有独钟(经常暴0&hellip;)，因此他认为非0数都是不和谐的。</div>
<div>于是他研究上了二进制数，因为里面的非0数只有1！</div>
<div>即便如此，1还是令他很不爽&hellip;</div>
<div>于是他想把所有的k位二进制数0、1、&hellip;2k -1划分成m组，每一组都是连续的一些数。设Si(1&le;i&le;m)表示第i组中所有数中的1的个数和。</div>
<div>小风想知道，所有的划分方案中，max{Si} 的最小值是多少。</div></div><h2>Input</h2><div class=content><div>有且仅有一行：两个数k、m，用一个空格分开。</div></div><h2>Output</h2><div class=content><div>有且仅有一行：一个数，表示max{Si} 的最小值</div></div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>3 4<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>4<br />
</span></div><h2>HINT</h2>
			<div class=content><p><p>【样例解释】<br /><br />
&nbsp;分成如下4组最优：<br /><br />
&nbsp;000 001 010 011<br /><br />
&nbsp;100 101<br /><br />
&nbsp;110<br /><br />
&nbsp;111<br /><br />
&nbsp;S1 = 4、S2 = 3、S3 = 2、S4 = 3<br /><br />
&nbsp;max{Si} = 4&nbsp;&nbsp;&nbsp;&nbsp; <br /><br />
【数据规模】<br /><br />
20%的数据中， k &le; 20<br /><br />
100%的数据中，1 &le; k &le; 100, 1 &le; m &le; 100 且 m &le;2k</p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=By 陈舒悦'>By 陈舒悦</a></p></div><center>[<a href='submitpage.php?id=2390'>Submit</a>][<a href='problemstatus.php?id=2390'>Status</a>][<a href='bbs.php?id=2390'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
